NP-hard problems

Results: 67



#Item
51 The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]

The Traveling Salesman (& J ) Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York [removed]

Add to Reading List

Source URL: www.cs.rit.edu

Language: English - Date: 2003-06-11 09:35:55
52Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2

Improved Generic Algorithms for Hard Knapsacks? Anja Becker1,?? , Jean-S´ebastien Coron3 , and Antoine Joux1,2 1 University of Versailles Saint-Quentin-en-Yvelines 2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2011-08-31 08:22:53
53Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied

Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied

Add to Reading List

Source URL: piercelab.caltech.edu

Language: English - Date: 2010-09-08 02:56:32
54A Simple Model to Generate Hard Satisfiable Instances Ke Xu1 1 Fr´ed´eric Boussemart2

A Simple Model to Generate Hard Satisfiable Instances Ke Xu1 1 Fr´ed´eric Boussemart2

Add to Reading List

Source URL: www.nlsde.buaa.edu.cn

Language: English - Date: 2005-04-26 01:56:54
55Classification of computational problems Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague FJFI, [removed]

Classification of computational problems Pavel Pudlák Mathematical Institute, Academy of Sciences, Prague FJFI, [removed]

Add to Reading List

Source URL: kolokvium.fjfi.cvut.cz

Language: English - Date: 2014-04-09 11:50:42
56Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30

Annual status workshop[removed]TU Berlin, 13-17h, MA 212 and[removed]TU Berlin, 13-17h, MA[removed]:00-13:30 13:30-14:00 14:00-14:30

Add to Reading List

Source URL: www3.math.tu-berlin.de

Language: English
57Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo

Complete Distributional Problems, Hard Languages, and Resource-Bounded Measure A. Pavan† Alan L. Selman‡ Department of Computer Science University at Buffalo

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 1997-10-21 12:14:50
58CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA

CAPTCHA: Using Hard AI Problems For Security Luis von Ahn1 , Manuel Blum1 , Nicholas J. Hopper1 , and John Langford2 1 Computer Science Dept., Carnegie Mellon University, Pittsburgh PA 15213, USA

Add to Reading List

Source URL: captcha.net

Language: English - Date: 2009-07-22 18:52:06
59Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed]

Holographic Algorithms Jin-Yi Cai ∗ Computer Sciences Department University of Wisconsin Madison, WI[removed]USA. Email: [removed]

Add to Reading List

Source URL: pages.cs.wisc.edu

Language: English - Date: 2007-09-05 18:26:13
60Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems

Add to Reading List

Source URL: theoryofcomputing.org

Language: English - Date: 2013-06-15 12:40:47